Interval Arithmetic in Cylindrical Algebraic Decomposition
نویسندگان
چکیده
منابع مشابه
A Symbiosis of Interval Constraint Propagation and Cylindrical Algebraic Decomposition
We present a novel decision procedure for non-linear real arithmetic: a combination of iSAT, an incomplete SMT solver based on interval constraint propagation (ICP), and an implementation of the complete cylindrical algebraic decomposition (CAD) method in the library GiNaCRA. While iSAT is efficient in finding unsatisfiability, on satisfiable instances it often terminates with an interval box w...
متن کاملLayered Cylindrical Algebraic Decomposition
In this paper the idea of a Layered CAD is introduced, a truncation of a CAD to only high dimensional cells. Limiting to full-dimensional cells has already been investigated in the literature, but including another level can be beneficial for applications. A related topological property is defined and related to robotics motion planning. The distribution of cell dimensions in a CAD is investiga...
متن کاملRegular cylindrical algebraic decomposition
We show that a strong well-based cylindrical algebraic decomposition P of a bounded semi-algebraic set is a regular cell decomposition, in any dimension and independently of the method by which P is constructed. Being well-based is a global condition on P that holds for the output of many widely used algorithms. We also show the same for S of dimension at most 3 and P a strong cylindrical algeb...
متن کاملAdvances in cylindrical algebraic decomposition
Cylindrical Algebraic Decomposition (CAD) was initially introduced to tackle the classic problem of quantifier elimination over real closed algebraic fields, however it has since seen many applications in its own right. Given a set of polynomials, multiple algorithms exist to produce a CAD such that over each cell the polynomials have constant sign. Inherently doubly exponential in the number o...
متن کاملCylindrical Algebraic Decomposition in the RegularChains Library
Cylindrical algebraic decomposition (CAD) is a fundamental tool in computational real algebraic geometry and has been implemented in several software. While existing implementations are all based on Collins’ projection-lifting scheme and its subsequent ameliorations, the implementation of CAD in the RegularChains library is based on triangular decomposition of polynomial systems and real root i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2002
ISSN: 0747-7171
DOI: 10.1006/jsco.2002.0547